________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        03.02.2010 20:13:09
Input Data from:  dataset103.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :100
# of Locations  :10
Ex.Facilities   :2
Total budget    :20000
Terror. attacks :2

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,077
Average f[i]   :4350
Average g[i,j] :2012,5
Total demand   :5670
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 9
> Selected Move:	530	1	-1	8	6500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0    >new incumb.: 530


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 29
> Selected Move:	1020	1	-1	7	10500


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  0    >new incumb.: 1020


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 31
> Selected Move:	1400	1	-1	2	15000


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  1  0    >new incumb.: 1400


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 32
> Selected Move:	1760	1	-1	6	19500


> New Y[]: 
	
	 2  3  1  0  0  0  1  1  1  0    >new incumb.: 1760


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 19
> Selected Move:	1520	3	6	4	20000


> New Y[]: 
	
	 2  3  1  0  1  0  0  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 19
> Selected Move:	1500	3	2	6	20000


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 21
> Selected Move:	1390	3	8	9	20000


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 19
> Selected Move:	1520	3	4	2	19500


> New Y[]: 
	
	 2  3  1  0  0  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 23
> Selected Move:	1480	3	9	5	19000


> New Y[]: 
	
	 2  3  1  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 26
> Selected Move:	1360	3	5	3	19500


> New Y[]: 
	
	 2  3  1  1  0  0  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 16
> Selected Move:	1350	3	3	4	18000


> New Y[]: 
	
	 2  3  1  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 29
> Selected Move:	1390	3	6	9	20000


> New Y[]: 
	
	 2  3  1  0  1  0  0  1  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 20
> Selected Move:	1220	3	9	5	19500


> New Y[]: 
	
	 2  3  1  0  1  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 23
> Selected Move:	1270	3	7	6	20000


> New Y[]: 
	
	 2  3  1  0  1  1  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 17
> Selected Move:	1340	3	5	8	20500


> New Y[]: 
	
	 2  3  1  0  1  0  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 17
> Selected Move:	1270	2	4	-1	15500


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 30
> Selected Move:	1380	3	2	7	15000


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 29
> Selected Move:	1290	3	1	9	17400


> New Y[]: 
	
	 2  0  0  0  0  0  1  1  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 12
> Selected Move:	1310	3	6	2	17400


> New Y[]: 
	
	 2  0  1  0  0  0  0  1  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 14
> Selected Move:	1310	4	9	2	18800


> New Y[]: 
	
	 2  0  3  0  0  0  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,43

## ITERATION 20 #######################


> Neighbours evaluated; 15
> Selected Move:	1310	4	2	7	19200


> New Y[]: 
	
	 2  0  1  0  0  0  0  3  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,425

## ITERATION 21 #######################


> Neighbours evaluated; 13
> Selected Move:	1310	4	7	8	16900


> New Y[]: 
	
	 2  0  1  0  0  0  0  1  3  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,42

## ITERATION 22 #######################


> Neighbours evaluated; 20
> Selected Move:	1290	3	2	6	16900


> New Y[]: 
	
	 2  0  0  0  0  0  1  1  3  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,415

## ITERATION 23 #######################


> Neighbours evaluated; 15
> Selected Move:	1290	4	8	6	18800


> New Y[]: 
	
	 2  0  0  0  0  0  3  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,41

## ITERATION 24 #######################


> Neighbours evaluated; 13
> Selected Move:	1290	4	6	7	19200


> New Y[]: 
	
	 2  0  0  0  0  0  1  3  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,405

## ITERATION 25 #######################


> Neighbours evaluated; 16
> Selected Move:	1230	3	9	2	17200


> New Y[]: 
	
	 2  0  1  0  0  0  1  3  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,4

## ITERATION 26 #######################


> Neighbours evaluated; 15
> Selected Move:	1230	4	7	2	16800


> New Y[]: 
	
	 2  0  3  0  0  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,395

## ITERATION 27 #######################


> Neighbours evaluated; 14
> Selected Move:	1230	4	2	6	16800


> New Y[]: 
	
	 2  0  1  0  0  0  3  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,39

## ITERATION 28 #######################


> Neighbours evaluated; 13
> Selected Move:	1230	4	6	8	14900


> New Y[]: 
	
	 2  0  1  0  0  0  1  1  3  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,385

## ITERATION 29 #######################


> Neighbours evaluated; 18
> Selected Move:	1350	1	-1	4	19900


> New Y[]: 
	
	 2  0  1  0  1  0  1  1  3  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,38

## ITERATION 30 #######################


> Neighbours evaluated; 18
> Selected Move:	1200	3	8	5	20000


> New Y[]: 
	
	 2  0  1  0  1  3  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 31 #######################


> Neighbours evaluated; 17
> Selected Move:	1200	3	5	9	20400


> New Y[]: 
	
	 2  0  1  0  1  0  1  1  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,37

## ITERATION 32 #######################


> Neighbours evaluated; 15
> Selected Move:	1180	2	4	-1	15400


> New Y[]: 
	
	 2  0  1  0  0  0  1  1  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0 
 > pw :0,365

## ITERATION 33 #######################


> Neighbours evaluated; 16
> Selected Move:	1230	3	9	1	13000


> New Y[]: 
	
	 2  3  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 34 #######################


> Neighbours evaluated; 29
> Selected Move:	1230	3	0	8	14900


> New Y[]: 
	
	 0  3  1  0  0  0  1  1  2  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,355

## ITERATION 35 #######################


> Neighbours evaluated; 17
> Selected Move:	1350	1	-1	4	19900


> New Y[]: 
	
	 0  3  1  0  1  0  1  1  2  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,35

## ITERATION 36 #######################


> Neighbours evaluated; 15
> Selected Move:	1200	3	8	5	19600


> New Y[]: 
	
	 0  3  1  0  1  2  1  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 37 #######################


> Neighbours evaluated; 13
> Selected Move:	1178	3	5	9	20500


> New Y[]: 
	
	 0  3  1  0  1  0  1  1  0  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1 
 > pw :0,34

## ITERATION 38 #######################


> Neighbours evaluated; 13
> Selected Move:	1140	2	4	-1	15500


> New Y[]: 
	
	 0  3  1  0  0  0  1  1  0  2 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0 
 > pw :0,335

## ITERATION 39 #######################


> Neighbours evaluated; 17
> Selected Move:	1180	3	1	8	17400


> New Y[]: 
	
	 0  0  1  0  0  0  1  1  3  2 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  1  0 
 > pw :0,33

## ITERATION 40 #######################


> Neighbours evaluated; 9
> Selected Move:	1180	4	8	2	19300


> New Y[]: 
	
	 0  0  3  0  0  0  1  1  1  2 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  1  0 
 > pw :0,325

## ITERATION 41 #######################


> Neighbours evaluated; 7
> Selected Move:	1180	4	2	6	19300


> New Y[]: 
	
	 0  0  1  0  0  0  3  1  1  2 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  1  0 
 > pw :0,32

## ITERATION 42 #######################


> Neighbours evaluated; 6
> Selected Move:	1180	4	6	7	19700


> New Y[]: 
	
	 0  0  1  0  0  0  1  3  1  2 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  1  0 
 > pw :0,315

## ITERATION 43 #######################


> Neighbours evaluated; 5
> Selected Move:	1180	4	7	9	19600


> New Y[]: 
	
	 0  0  1  0  0  0  1  2  1  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  1  0 
 > pw :0,31

## ITERATION 44 #######################


> Neighbours evaluated; 7
> Selected Move:	1230	3	9	1	17200


> New Y[]: 
	
	 0  3  1  0  0  0  1  2  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,305

## ITERATION 45 #######################


> Neighbours evaluated; 15
> Selected Move:	1230	4	7	2	17500


> New Y[]: 
	
	 0  3  2  0  0  0  1  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,3

## ITERATION 46 #######################


> Neighbours evaluated; 14
> Selected Move:	1230	4	2	6	17200


> New Y[]: 
	
	 0  3  1  0  0  0  2  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,295

## ITERATION 47 #######################


> Neighbours evaluated; 18
> Selected Move:	1180	3	1	9	19600


> New Y[]: 
	
	 0  0  1  0  0  0  2  1  1  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  1  0 
 > pw :0,29

## ITERATION 48 #######################


> Neighbours evaluated; 4
> Selected Move:	1180	4	6	2	19900


> New Y[]: 
	
	 0  0  2  0  0  0  1  1  1  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  1  0 
 > pw :0,285

## ITERATION 49 #######################


> Neighbours evaluated; 3
> Selected Move:	1180	4	2	8	17300


> New Y[]: 
	
	 0  0  1  0  0  0  1  1  2  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  1  0 
 > pw :0,28

## ITERATION 50 #######################


> Neighbours evaluated; 4
> Selected Move:	1180	4	9	2	18700


> New Y[]: 
	
	 0  0  3  0  0  0  1  1  2  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  1  0 
 > pw :0,275

## ITERATION 51 #######################


> Neighbours evaluated; 7
> Selected Move:	1180	4	2	6	18700


> New Y[]: 
	
	 0  0  1  0  0  0  3  1  2  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  1  0 
 > pw :0,27

## ITERATION 52 #######################


> Neighbours evaluated; 6
> Selected Move:	1180	4	6	7	19100


> New Y[]: 
	
	 0  0  1  0  0  0  1  3  2  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  1  0 
 > pw :0,265

## ITERATION 53 #######################


> Neighbours evaluated; 5
> Selected Move:	1180	4	7	8	19100


> New Y[]: 
	
	 0  0  1  0  0  0  1  2  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  1  0 
 > pw :0,26

## ITERATION 54 #######################


> Neighbours evaluated; 5
> Selected Move:	1180	4	7	2	19400


> New Y[]: 
	
	 0  0  2  0  0  0  1  1  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  1  0 
 > pw :0,255

## ITERATION 55 #######################


> Neighbours evaluated; 3
> Selected Move:	1180	4	2	6	19100


> New Y[]: 
	
	 0  0  1  0  0  0  2  1  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  1  0 
 > pw :0,25

## ITERATION 56 #######################


> Neighbours evaluated; 8
> Selected Move:	1140	3	8	1	17200


> New Y[]: 
	
	 0  3  1  0  0  0  2  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0 
 > pw :0,245

## ITERATION 57 #######################


> Neighbours evaluated; 16
> Selected Move:	1160	3	6	0	15000


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0 
 > pw :0,24

## ITERATION 58 #######################


> Neighbours evaluated; 30
> Selected Move:	1290	1	-1	8	21500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,235

## ITERATION 59 #######################


> Neighbours evaluated; 16
> Selected Move:	1278	3	2	6	21500


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,23

## ITERATION 60 #######################


> Neighbours evaluated; 16
> Selected Move:	1270	2	6	-1	17000


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,225

## ITERATION 61 #######################


> Neighbours evaluated; 30
> Selected Move:	1160	3	0	2	19500


> New Y[]: 
	
	 0  3  2  0  0  0  0  1  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  1  0 
 > pw :0,22

## ITERATION 62 #######################


> Neighbours evaluated; 17
> Selected Move:	1160	4	2	7	19200


> New Y[]: 
	
	 0  3  1  0  0  0  0  2  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  1  0 
 > pw :0,215

## ITERATION 63 #######################


> Neighbours evaluated; 18
> Selected Move:	1160	4	7	8	16900


> New Y[]: 
	
	 0  3  1  0  0  0  0  1  2  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  1  0 
 > pw :0,21

## ITERATION 64 #######################


> Neighbours evaluated; 17
> Selected Move:	1226	1	-1	6	21400


> New Y[]: 
	
	 0  3  1  0  0  0  1  1  2  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  1  0 
 > pw :0,205

## ITERATION 65 #######################


> Neighbours evaluated; 16
> Selected Move:	1165	3	8	5	21100


> New Y[]: 
	
	 0  3  1  0  0  2  1  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0 
 > pw :0,2

## ITERATION 66 #######################


> Neighbours evaluated; 12
> Selected Move:	1110	3	5	4	21200


> New Y[]: 
	
	 0  3  1  0  2  0  1  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1 
 > pw :0,205

## ITERATION 67 #######################


> Neighbours evaluated; 16
> Selected Move:	1104	3	9	8	21200


> New Y[]: 
	
	 0  3  1  0  2  0  1  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,21

## ITERATION 68 #######################


> Neighbours evaluated; 16
> Selected Move:	1100	3	4	9	22000


> New Y[]: 
	
	 0  3  1  0  0  0  1  1  1  2 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  1  0 
 > pw :0,215

## ITERATION 69 #######################


> Neighbours evaluated; 16
> Selected Move:	1160	2	6	-1	17500


> New Y[]: 
	
	 0  3  1  0  0  0  0  1  1  2 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  1  0 
 > pw :0,22

## ITERATION 70 #######################


> Neighbours evaluated; 18
> Selected Move:	1140	3	2	6	17500


> New Y[]: 
	
	 0  3  0  0  0  0  1  1  1  2 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  1  0 
 > pw :0,225

## ITERATION 71 #######################


> Neighbours evaluated; 16
> Selected Move:	1140	4	9	6	19200


> New Y[]: 
	
	 0  3  0  0  0  0  2  1  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  1  0 
 > pw :0,23

## ITERATION 72 #######################


> Neighbours evaluated; 14
> Selected Move:	1140	4	6	7	19200


> New Y[]: 
	
	 0  3  0  0  0  0  1  2  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  1  0 
 > pw :0,235

## ITERATION 73 #######################


> Neighbours evaluated; 16
> Selected Move:	1140	4	7	8	16900


> New Y[]: 
	
	 0  3  0  0  0  0  1  1  2  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  1  0 
 > pw :0,24

## ITERATION 74 #######################


> Neighbours evaluated; 19
> Selected Move:	1140	3	7	2	17400


> New Y[]: 
	
	 0  3  1  0  0  0  1  0  2  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  1  0 
 > pw :0,235

## ITERATION 75 #######################


> Neighbours evaluated; 15
> Selected Move:	1140	4	8	2	20000


> New Y[]: 
	
	 0  3  2  0  0  0  1  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  1  0 
 > pw :0,23

## ITERATION 76 #######################


> Neighbours evaluated; 13
> Selected Move:	1140	4	2	6	19700


> New Y[]: 
	
	 0  3  1  0  0  0  2  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  1  0 
 > pw :0,225

## ITERATION 77 #######################


> Neighbours evaluated; 11
> Selected Move:	1160	3	6	0	17500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,22

## ITERATION 78 #######################


> Neighbours evaluated; 30
> Selected Move:	1210	3	9	4	16000


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 79 #######################


> Neighbours evaluated; 34
> Selected Move:	1190	3	2	6	16000


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 80 #######################


> Neighbours evaluated; 32
> Selected Move:	1140	3	4	9	17500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,205

## ITERATION 81 #######################


> Neighbours evaluated; 28
> Selected Move:	1180	3	1	2	19300


> New Y[]: 
	
	 2  0  3  0  0  0  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,2

## ITERATION 82 #######################


> Neighbours evaluated; 14
> Selected Move:	1180	4	2	6	19300


> New Y[]: 
	
	 2  0  1  0  0  0  3  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,195

## ITERATION 83 #######################


> Neighbours evaluated; 13
> Selected Move:	1180	4	6	8	17400


> New Y[]: 
	
	 2  0  1  0  0  0  1  0  3  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,19

## ITERATION 84 #######################


> Neighbours evaluated; 15
> Selected Move:	1404	1	-1	7	21400


> New Y[]: 
	
	 2  0  1  0  0  0  1  1  3  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,185

## ITERATION 85 #######################


> Neighbours evaluated; 8
> Selected Move:	1319	4	8	9	21900


> New Y[]: 
	
	 2  0  1  0  0  0  1  1  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,18

## ITERATION 86 #######################


> Neighbours evaluated; 14
> Selected Move:	1180	2	7	-1	17900


> New Y[]: 
	
	 2  0  1  0  0  0  1  0  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,175

## ITERATION 87 #######################


> Neighbours evaluated; 17
> Selected Move:	1120	3	6	4	18400


> New Y[]: 
	
	 2  0  1  0  1  0  0  0  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,17

## ITERATION 88 #######################


> Neighbours evaluated; 20
> Selected Move:	1120	4	9	2	19800


> New Y[]: 
	
	 2  0  3  0  1  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,165

## ITERATION 89 #######################


> Neighbours evaluated; 17
> Selected Move:	1120	4	2	4	19800


> New Y[]: 
	
	 2  0  1  0  3  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,16

## ITERATION 90 #######################


> Neighbours evaluated; 15
> Selected Move:	1120	4	4	8	17900


> New Y[]: 
	
	 2  0  1  0  1  0  0  0  3  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,155

## ITERATION 91 #######################


> Neighbours evaluated; 22
> Selected Move:	1136	1	-1	7	21900


> New Y[]: 
	
	 2  0  1  0  1  0  0  1  3  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,15

## ITERATION 92 #######################


> Neighbours evaluated; 16
> Selected Move:	1125	3	2	6	21900


> New Y[]: 
	
	 2  0  0  0  1  0  1  1  3  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,145

## ITERATION 93 #######################


> Neighbours evaluated; 16
> Selected Move:	1132	3	7	2	22400


> New Y[]: 
	
	 2  0  1  0  1  0  1  0  3  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,15

## ITERATION 94 #######################


> Neighbours evaluated; 9
> Selected Move:	1365	3	8	1	20500


> New Y[]: 
	
	 2  3  1  0  1  0  1  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 95 #######################


> Neighbours evaluated; 30
> Selected Move:	1210	3	4	8	22000


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,16

## ITERATION 96 #######################


> Neighbours evaluated; 15
> Selected Move:	1150	3	8	5	21500


> New Y[]: 
	
	 2  3  1  0  0  1  1  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 97 #######################


> Neighbours evaluated; 28
> Selected Move:	1245	3	6	7	21000


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0 
 > pw :0,17

## ITERATION 98 #######################


> Neighbours evaluated; 24
> Selected Move:	1250	3	9	8	21000


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 99 #######################


> Neighbours evaluated; 28
> Selected Move:	1258	3	5	3	21500


> New Y[]: 
	
	 2  3  1  1  0  0  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,18

## ITERATION 100 #######################


> Neighbours evaluated; 19
> Selected Move:	1230	3	2	6	21500


> New Y[]: 
	
	 2  3  0  1  0  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,185

## ITERATION 101 #######################


> Neighbours evaluated; 18
> Selected Move:	1215	3	3	5	21000


> New Y[]: 
	
	 2  3  0  0  0  1  1  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 102 #######################


> Neighbours evaluated; 28
> Selected Move:	1200	3	8	4	19500


> New Y[]: 
	
	 2  3  0  0  1  1  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 103 #######################


> Neighbours evaluated; 30
> Selected Move:	1195	3	4	9	21000


> New Y[]: 
	
	 2  3  0  0  0  1  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0 
 > pw :0,2

## ITERATION 104 #######################


> Neighbours evaluated; 23
> Selected Move:	1140	2	5	-1	15000


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0 
 > pw :0,205

## ITERATION 105 #######################


> Neighbours evaluated; 27
> Selected Move:	1180	3	1	2	16800


> New Y[]: 
	
	 2  0  3  0  0  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0 
 > pw :0,21

## ITERATION 106 #######################


> Neighbours evaluated; 14
> Selected Move:	1180	4	2	6	16800


> New Y[]: 
	
	 2  0  1  0  0  0  3  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0 
 > pw :0,215

## ITERATION 107 #######################


> Neighbours evaluated; 12
> Selected Move:	1180	4	6	7	17200


> New Y[]: 
	
	 2  0  1  0  0  0  1  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0 
 > pw :0,22

## ITERATION 108 #######################


> Neighbours evaluated; 19
> Selected Move:	1140	3	7	1	15500


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 109 #######################


> Neighbours evaluated; 27
> Selected Move:	1140	3	0	7	17200


> New Y[]: 
	
	 0  3  1  0  0  0  1  2  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0 
 > pw :0,21

## ITERATION 110 #######################


> Neighbours evaluated; 12
> Selected Move:	1140	4	7	2	17500


> New Y[]: 
	
	 0  3  2  0  0  0  1  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0 
 > pw :0,205

## ITERATION 111 #######################


> Neighbours evaluated; 15
> Selected Move:	1040	3	7	4	18500


> New Y[]: 
	
	 0  3  2  0  1  0  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1 
 > pw :0,2

## ITERATION 112 #######################


> Neighbours evaluated; 19
> Selected Move:	1080	3	2	0	16000


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,195

## ITERATION 113 #######################


> Neighbours evaluated; 32
> Selected Move:	1100	3	1	8	17900


> New Y[]: 
	
	 2  0  0  0  1  0  1  0  3  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,19

## ITERATION 114 #######################


> Neighbours evaluated; 15
> Selected Move:	1100	4	8	4	19800


> New Y[]: 
	
	 2  0  0  0  3  0  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,185

## ITERATION 115 #######################


> Neighbours evaluated; 13
> Selected Move:	1100	4	4	6	19800


> New Y[]: 
	
	 2  0  0  0  1  0  3  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,18

## ITERATION 116 #######################


> Neighbours evaluated; 13
> Selected Move:	1100	4	6	9	18400


> New Y[]: 
	
	 2  0  0  0  1  0  1  0  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,175

## ITERATION 117 #######################


> Neighbours evaluated; 20
> Selected Move:	1050	3	6	7	17900


> New Y[]: 
	
	 2  0  0  0  1  0  0  1  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,17

## ITERATION 118 #######################


> Neighbours evaluated; 18
> Selected Move:	1140	3	9	1	15500


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 119 #######################


> Neighbours evaluated; 30
> Selected Move:	1140	3	4	3	17000


> New Y[]: 
	
	 2  3  0  1  0  0  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,16

## ITERATION 120 #######################


> Neighbours evaluated; 31
> Selected Move:	1040	3	3	5	16500


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 121 #######################


> Neighbours evaluated; 30
> Selected Move:	1120	3	8	2	14500


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 122 #######################


> Neighbours evaluated; 32
> Selected Move:	1100	3	2	6	14500


> New Y[]: 
	
	 2  3  0  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 123 #######################


> Neighbours evaluated; 29
> Selected Move:	1085	1	-1	3	21000


> New Y[]: 
	
	 2  3  0  1  0  1  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 124 #######################


> Neighbours evaluated; 29
> Selected Move:	1110	3	6	2	21000


> New Y[]: 
	
	 2  3  1  1  0  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 125 #######################


> Neighbours evaluated; 31
> Selected Move:	1120	3	5	4	20000


> New Y[]: 
	
	 2  3  1  1  1  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 126 #######################


> Neighbours evaluated; 34
> Selected Move:	1105	3	7	6	20500


> New Y[]: 
	
	 2  3  1  1  1  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 127 #######################


> Neighbours evaluated; 33
> Selected Move:	1140	3	4	8	22000


> New Y[]: 
	
	 2  3  1  1  0  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,12

## ITERATION 128 #######################


> Neighbours evaluated; 29
> Selected Move:	1160	1	-1	7	26000


> New Y[]: 
	
	 2  3  1  1  0  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,125

## ITERATION 129 #######################


> Neighbours evaluated; 10
> Selected Move:	1318	3	3	4	24500


> New Y[]: 
	
	 2  3  1  0  1  0  1  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 130 #######################


> Neighbours evaluated; 19
> Selected Move:	1230	3	4	9	26000


> New Y[]: 
	
	 2  3  1  0  0  0  1  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,135

## ITERATION 131 #######################


> Neighbours evaluated; 16
> Selected Move:	1225	4	1	2	23300


> New Y[]: 
	
	 2  0  3  0  0  0  1  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,14

## ITERATION 132 #######################


> Neighbours evaluated; 10
> Selected Move:	1208	4	2	6	23300


> New Y[]: 
	
	 2  0  1  0  0  0  3  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,145

## ITERATION 133 #######################


> Neighbours evaluated; 9
> Selected Move:	1134	4	6	7	23700


> New Y[]: 
	
	 2  0  1  0  0  0  1  3  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,15

## ITERATION 134 #######################


> Neighbours evaluated; 12
> Selected Move:	1020	3	8	4	22200


> New Y[]: 
	
	 2  0  1  0  1  0  1  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,155

## ITERATION 135 #######################


> Neighbours evaluated; 16
> Selected Move:	1071	4	7	2	21800


> New Y[]: 
	
	 2  0  3  0  1  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,16

## ITERATION 136 #######################


> Neighbours evaluated; 15
> Selected Move:	1062	4	2	4	21800


> New Y[]: 
	
	 2  0  1  0  3  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,165

## ITERATION 137 #######################


> Neighbours evaluated; 14
> Selected Move:	1183	3	4	5	21500


> New Y[]: 
	
	 2  0  1  0  0  3  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0 
 > pw :0,17

## ITERATION 138 #######################


> Neighbours evaluated; 14
> Selected Move:	1192	4	5	9	21400


> New Y[]: 
	
	 2  0  1  0  0  1  1  1  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0 
 > pw :0,175

## ITERATION 139 #######################


> Neighbours evaluated; 17
> Selected Move:	1133	3	9	8	20900


> New Y[]: 
	
	 2  0  1  0  0  1  1  1  3  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0 
 > pw :0,18

## ITERATION 140 #######################


> Neighbours evaluated; 20
> Selected Move:	1108	3	5	3	21400


> New Y[]: 
	
	 2  0  1  1  0  0  1  1  3  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,185

## ITERATION 141 #######################


> Neighbours evaluated; 14
> Selected Move:	1009	4	8	3	21900


> New Y[]: 
	
	 2  0  1  3  0  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,19

## ITERATION 142 #######################


> Neighbours evaluated; 15
> Selected Move:	1024	3	8	4	20400


> New Y[]: 
	
	 2  0  1  3  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 143 #######################


> Neighbours evaluated; 24
> Selected Move:	870	2	4	-1	15400


> New Y[]: 
	
	 2  0  1  3  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0 
 > pw :0,2

## ITERATION 144 #######################


> Neighbours evaluated; 25
> Selected Move:	1000	3	6	8	17400


> New Y[]: 
	
	 2  0  1  3  0  0  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,205

## ITERATION 145 #######################


> Neighbours evaluated; 20
> Selected Move:	1000	4	3	2	18800


> New Y[]: 
	
	 2  0  3  1  0  0  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,21

## ITERATION 146 #######################


> Neighbours evaluated; 19
> Selected Move:	1000	4	2	7	19200


> New Y[]: 
	
	 2  0  1  1  0  0  0  3  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,215

## ITERATION 147 #######################


> Neighbours evaluated; 17
> Selected Move:	1030	3	7	1	17500


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,22

## ITERATION 148 #######################


> Neighbours evaluated; 30
> Selected Move:	1010	3	2	6	17500


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,215

## ITERATION 149 #######################


> Neighbours evaluated; 30
> Selected Move:	980	3	0	7	19200


> New Y[]: 
	
	 0  3  0  1  0  0  1  2  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,21

## ITERATION 150 #######################


> Neighbours evaluated; 12
> Selected Move:	1000	3	6	2	19200


> New Y[]: 
	
	 0  3  1  1  0  0  0  2  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,205

## ITERATION 151 #######################


> Neighbours evaluated; 15
> Selected Move:	1000	4	7	2	19500


> New Y[]: 
	
	 0  3  2  1  0  0  0  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,2

## ITERATION 152 #######################


> Neighbours evaluated; 13
> Selected Move:	1000	4	2	3	16800


> New Y[]: 
	
	 0  3  1  2  0  0  0  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,195

## ITERATION 153 #######################


> Neighbours evaluated; 16
> Selected Move:	1107	1	-1	6	21300


> New Y[]: 
	
	 0  3  1  2  0  0  1  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,19

## ITERATION 154 #######################


> Neighbours evaluated; 7
> Selected Move:	1100	3	8	4	19800


> New Y[]: 
	
	 0  3  1  2  1  0  1  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 155 #######################


> Neighbours evaluated; 21
> Selected Move:	972	3	4	5	20800


> New Y[]: 
	
	 0  3  1  2  0  1  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  1  0  0 
 > pw :0,18

## ITERATION 156 #######################


> Neighbours evaluated; 11
> Selected Move:	1128	3	3	8	20900


> New Y[]: 
	
	 0  3  1  0  0  1  1  1  2  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  1  0  0 
 > pw :0,175

## ITERATION 157 #######################


> Neighbours evaluated; 18
> Selected Move:	1128	3	8	9	21500


> New Y[]: 
	
	 0  3  1  0  0  1  1  1  0  2 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0 
 > pw :0,17

## ITERATION 158 #######################


> Neighbours evaluated; 15
> Selected Move:	1081	3	9	4	20700


> New Y[]: 
	
	 0  3  1  0  2  1  1  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 159 #######################


> Neighbours evaluated; 19
> Selected Move:	970	2	5	-1	14700


> New Y[]: 
	
	 0  3  1  0  2  0  1  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 160 #######################


> Neighbours evaluated; 23
> Selected Move:	1040	3	7	8	17200


> New Y[]: 
	
	 0  3  1  0  2  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,185

## ITERATION 161 #######################


> Neighbours evaluated; 17
> Selected Move:	1140	3	4	9	18000


> New Y[]: 
	
	 0  3  1  0  0  0  1  0  1  2 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  1  0 
 > pw :0,19

## ITERATION 162 #######################


> Neighbours evaluated; 14
> Selected Move:	1080	3	2	4	18500


> New Y[]: 
	
	 0  3  0  0  1  0  1  0  1  2 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  0 
 > pw :0,195

## ITERATION 163 #######################


> Neighbours evaluated; 16
> Selected Move:	1080	4	9	4	19200


> New Y[]: 
	
	 0  3  0  0  2  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  0 
 > pw :0,19

## ITERATION 164 #######################


> Neighbours evaluated; 12
> Selected Move:	1080	4	4	8	17900


> New Y[]: 
	
	 0  3  0  0  1  0  1  0  2  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  0 
 > pw :0,185

## ITERATION 165 #######################


> Neighbours evaluated; 14
> Selected Move:	1080	3	6	2	17900


> New Y[]: 
	
	 0  3  1  0  1  0  0  0  2  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  1  0 
 > pw :0,18

## ITERATION 166 #######################


> Neighbours evaluated; 17
> Selected Move:	1080	4	8	4	19200


> New Y[]: 
	
	 0  3  1  0  2  0  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  1  0 
 > pw :0,175

## ITERATION 167 #######################


> Neighbours evaluated; 11
> Selected Move:	1080	4	4	9	18500


> New Y[]: 
	
	 0  3  1  0  1  0  0  0  1  2 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  1  0 
 > pw :0,17

## ITERATION 168 #######################


> Neighbours evaluated; 14
> Selected Move:	1050	3	2	7	18000


> New Y[]: 
	
	 0  3  0  0  1  0  0  1  1  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,165

## ITERATION 169 #######################


> Neighbours evaluated; 17
> Selected Move:	1050	4	9	4	18700


> New Y[]: 
	
	 0  3  0  0  2  0  0  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,16

## ITERATION 170 #######################


> Neighbours evaluated; 14
> Selected Move:	1050	4	4	7	19700


> New Y[]: 
	
	 0  3  0  0  1  0  0  2  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,155

## ITERATION 171 #######################


> Neighbours evaluated; 15
> Selected Move:	1080	3	7	0	18000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,15

## ITERATION 172 #######################


> Neighbours evaluated; 27
> Selected Move:	1090	1	-1	7	22000


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,145

## ITERATION 173 #######################


> Neighbours evaluated; 19
> Selected Move:	1098	3	7	2	22500


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,14

## ITERATION 174 #######################


> Neighbours evaluated; 16
> Selected Move:	1090	3	2	6	22500


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,135

## ITERATION 175 #######################


> Neighbours evaluated; 12
> Selected Move:	1053	4	0	6	20200


> New Y[]: 
	
	 0  3  0  0  1  0  2  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  0 
 > pw :0,13

## ITERATION 176 #######################


> Neighbours evaluated; 13
> Selected Move:	1040	3	8	2	18200


> New Y[]: 
	
	 0  3  1  0  1  0  2  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1 
 > pw :0,125

## ITERATION 177 #######################


> Neighbours evaluated; 16
> Selected Move:	1080	3	6	0	16000


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,12

## ITERATION 178 #######################


> Neighbours evaluated; 28
> Selected Move:	1070	1	-1	5	22000


> New Y[]: 
	
	 2  3  1  0  1  1  0  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 179 #######################


> Neighbours evaluated; 30
> Selected Move:	1093	3	2	7	21500


> New Y[]: 
	
	 2  3  0  0  1  1  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 180 #######################


> Neighbours evaluated; 30
> Selected Move:	1050	3	7	6	22000


> New Y[]: 
	
	 2  3  0  0  1  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,135

## ITERATION 181 #######################


> Neighbours evaluated; 28
> Selected Move:	1030	2	4	-1	17000


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,14

## ITERATION 182 #######################


> Neighbours evaluated; 30
> Selected Move:	1050	3	1	7	18700


> New Y[]: 
	
	 2  0  0  0  0  1  1  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0 
 > pw :0,145

## ITERATION 183 #######################


> Neighbours evaluated; 17
> Selected Move:	1070	3	6	2	18700


> New Y[]: 
	
	 2  0  1  0  0  1  0  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0 
 > pw :0,15

## ITERATION 184 #######################


> Neighbours evaluated; 19
> Selected Move:	1070	4	7	2	18300


> New Y[]: 
	
	 2  0  3  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0 
 > pw :0,145

## ITERATION 185 #######################


> Neighbours evaluated; 21
> Selected Move:	1070	4	2	5	17000


> New Y[]: 
	
	 2  0  1  0  0  3  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0 
 > pw :0,14

## ITERATION 186 #######################


> Neighbours evaluated; 19
> Selected Move:	1070	4	5	9	16900


> New Y[]: 
	
	 2  0  1  0  0  1  0  1  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0 
 > pw :0,135

## ITERATION 187 #######################


> Neighbours evaluated; 22
> Selected Move:	1050	3	2	6	16900


> New Y[]: 
	
	 2  0  0  0  0  1  1  1  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0 
 > pw :0,13

## ITERATION 188 #######################


> Neighbours evaluated; 17
> Selected Move:	1050	4	9	5	17000


> New Y[]: 
	
	 2  0  0  0  0  3  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0 
 > pw :0,125

## ITERATION 189 #######################


> Neighbours evaluated; 16
> Selected Move:	1050	4	5	6	18300


> New Y[]: 
	
	 2  0  0  0  0  1  3  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0 
 > pw :0,12

## ITERATION 190 #######################


> Neighbours evaluated; 18
> Selected Move:	1094	1	-1	2	22800


> New Y[]: 
	
	 2  0  1  0  0  1  3  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0 
 > pw :0,115

## ITERATION 191 #######################


> Neighbours evaluated; 15
> Selected Move:	1143	3	5	4	21800


> New Y[]: 
	
	 2  0  1  0  1  0  3  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,11

## ITERATION 192 #######################


> Neighbours evaluated; 19
> Selected Move:	1152	3	9	8	21800


> New Y[]: 
	
	 2  0  1  0  1  0  3  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,105

## ITERATION 193 #######################


> Neighbours evaluated; 21
> Selected Move:	1178	3	6	9	22400


> New Y[]: 
	
	 2  0  1  0  1  0  0  1  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,0999999999999996

## ITERATION 194 #######################


> Neighbours evaluated; 17
> Selected Move:	1190	3	7	6	22900


> New Y[]: 
	
	 2  0  1  0  1  0  1  0  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,105

## ITERATION 195 #######################


> Neighbours evaluated; 14
> Selected Move:	1158	3	2	7	22400


> New Y[]: 
	
	 2  0  0  0  1  0  1  1  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,11

## ITERATION 196 #######################


> Neighbours evaluated; 16
> Selected Move:	1152	3	9	2	21800


> New Y[]: 
	
	 2  0  3  0  1  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,115

## ITERATION 197 #######################


> Neighbours evaluated; 18
> Selected Move:	1143	4	2	4	21800


> New Y[]: 
	
	 2  0  1  0  3  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0 
 > pw :0,12

## ITERATION 198 #######################


> Neighbours evaluated; 18
> Selected Move:	1110	3	4	5	21500


> New Y[]: 
	
	 2  0  1  0  0  3  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0 
 > pw :0,125

## ITERATION 199 #######################


> Neighbours evaluated; 24
> Selected Move:	990	2	8	-1	15000


> New Y[]: 
	
	 2  0  1  0  0  3  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0 
 > pw :0,13

## ITERATION 200 #######################


> Neighbours evaluated; 21
> Selected Move:	990	4	5	2	16300


> New Y[]: 
	
	 2  0  3  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0 
 > pw :0,135

## ITERATION 201 #######################


> Neighbours evaluated; 22
> Selected Move:	1052	1	-1	9	22800


> New Y[]: 
	
	 2  0  3  0  0  1  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0 
 > pw :0,14

## ITERATION 202 #######################


> Neighbours evaluated; 13
> Selected Move:	1018	3	9	4	21300


> New Y[]: 
	
	 2  0  3  0  1  1  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 203 #######################


> Neighbours evaluated; 18
> Selected Move:	1012	4	2	4	21300


> New Y[]: 
	
	 2  0  1  0  3  1  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,15
________________________________________________________________

Best solution found: 1760
Run Termination time: 03.02.2010 20:13:32
Run duration: 00:00:23.1406250
________________________________________________________________
